An experimental comparison of some heuristics for cardinality constrained bin packing problem
نویسندگان
چکیده
منابع مشابه
An experimental comparison of some heuristics for cardinality constrained bin packing problem
Background: Bin packing is an NP hard optimization problem of packing items of given sizes into minimum number of capacity limited bins. Besides the basic problem, numerous other variants of bin packing exist. The cardinality constrained bin packing adds an additional constraint that the number of items in a bin must not exceed a given limit Nmax. Objectives: Goal of the paper is to present a p...
متن کاملAn Alternative Heuristics for Bin Packing Problem
This study describes an alternative development of metaheuristic approaches to automate a one dimensional problem. Extensive computational testing is done to demonstrate the effectiveness of the proposed heuristic, a Variable Neighbourhood Search (VNS)-based algorithm. Several heuristics algorithms that have been used for solving the bin packing problem, Exact algorithm, Random Algorithm, First...
متن کاملBranch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
There appear to be two versions of the Dual Bin Packing problem in the literature. In addition, one of the versions has a counterpart in the cutting stock literature, known as the Skiving Stock Problem. This paper outlines branch-andprice algorithms for both. We introduce combinatorial upper bounds and well-performing heuristics from the literature in the branch-and-price framework. Extensive c...
متن کاملOn a Constrained Bin-packing Problem
We study a bin-packing problem which is one-dimensional and is constrained in the manner items are placed into bins. The problem is motivated by a practical realtime scheduling problem, where redundant periodic tasks need to be assigned to a multiprocessor system. The problem is stated in the traditional light: to use as few bins as possible to pack a given list of items, and it is a generaliza...
متن کاملHeuristics for the variable sized bin-packing problem
The Variable Sized Bin Packing Problem has a wide range of application areas including packing, scheduling, and manufacturing. Given a list of items and variable sized bin types, the objective is to minimize the total size of the used bins. This problem is known to be NP-hard. In this article, we present two new heuristics for solving the problem using a new variation of P systems with active m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BSRJ
سال: 2012
ISSN: 1847-9375,1847-8344
DOI: 10.2478/v10305-012-0013-1